Batch 3 - Class 235 - Uncut Spaghetti

(zoom)
Pre-Class Exercise

Attendance     Kabir, Vansh, Kushagra, Rhea, Rohan, Anshi, Angad, Shikher, Aashvi, Anishka, Arnav, Arjun, Aarkin, Rehaan, Advay, SidharthM, Muskaan

Class puzzles (Built on top of Class 122; powerpoint available)

Grids represent plates of spaghetti. You may start eating a spaghetti from any number, and then go to the smallest adjacent (4 sides) number, and so on. The objective is to not break the spaghetti, i.e. always have a place to go to an unvisited square. Is it always possible to do so on the given grids?



Homework
(Dudeney 242) A tube inspector has been appointed, and he has to inspect the 17 lines connecting 12 stations of the tube regularly. In each phase, he wants to cover as little distance as possible to inspect the entire system. Each link is 1 mile long. Provide the shortest route that enables him to do so - he is free to start and end at any station.

References:      
https://ia902701.us.archive.org/4/items/AmusementsInMathematicspdf/AmusementsInMathematics.pdf - Dudeney
http://mathpickle.com/project/uncut-spaghetti-number-patterns/